Short proofs for interval digraphs
نویسنده
چکیده
We give short proofs of the adjacency matrix characterizations of interval digraphs and unit interval digraphs.
منابع مشابه
Interval order representation via shortest paths
Our goal in this paper is to illustrate how the representation theorems for finite interval orders and semiorders can be seen as special instances of existence results for potentials in digraphs. This viewpoint yields short proofs of the representation theorems and provides a framework for certain types of additional constraints on the intervals. We also use it to obtain a minimax theorem for t...
متن کاملRepresenting digraphs using intervals or circular arcs
Containment and overlap representations of digraphs are studied, with the following results. The interval containment digraphs are the digraphs of Ferrers dimension 2, and the circular-arc containment digraphs are the complements of circular-arc intersection digraphs. A poset is an interval containment poset if and only if its comparability digraph is an interval containment digraph, and a grap...
متن کاملA note on positive deniteness and stability of interval matrices
It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...
متن کاملA note on positive deniteness and stability of interval matrices
It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...
متن کاملStrongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
We consider the problem (MSSS) of nding a strongly connected spanning subgraph with the minimum number of arcs in a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the hamil-tonian cycle problem. We show that the problem is polynomially solvable for quasi-transitive digraphs. We describe the minimum number of arcs in such a spanning subgraph of a qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 178 شماره
صفحات -
تاریخ انتشار 1998